Balancing Algorithm for Three Matrices

نویسنده

  • NELA BOSNER
چکیده

Three versions of an algorithm for balancing three matrices simultaneously are proposed. The balancing is performed by premultiplication and postmultiplication with positive definite diagonal matrices, in order to reduce the magnitude range of all elements in the involved matrices. Some numerically stable algorithms, when applied to matrices with a wide range in the magnitude of elements, can produce results with a large error. As an application we present several problems from control theory. A reduction to the m-Hessenberg–triangular–triangular form is efficiently used for computing the frequency response G(σ) = C(σE − A)−1B + D of a descriptor system. The reduction algorithm can produce inaccurate results for badly scaled matrices. Numerical experiments confirmed that balancing matrices A, B and E before the m-Hessenberg–triangular–triangular reduction can produce an accurate frequency response matrix. Balancing three matrices can also improve the solution of the pole assignment problem for descriptor linear systems via state feedback, and the determination of the controllable part of the system. Other applications are: the quadratic eigenvalue problem λ2Ax+ λEx+Bx = 0, solution of the algebraic linear system (σ2A+ σB + C)x = b for several values of the parameter σ, and any other problems involving three matrices of same dimensions. These problems are not covered by the paper, but they can be balanced with a simplified version of the proposed algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Balancing three matrices in control theory

Abstract. Several problems from control theory are presented which are sensitive to badly scaled matrices. We were specially concerned with the algorithms involving three matrices, thus we extended the Ward’s balancing algorithm for two matrices. Numerical experiments confirmed that balancing three matrices can produce an accurate frequency response matrix for descriptor linear systems, it can ...

متن کامل

Online Distribution and Load Balancing Optimization Using the Robin Hood and Johnson Hybrid Algorithm

Proper planning of assembly lines is one of the production managers’ concerns at the tactical level so that it would be possible to use the machine capacity, reduce operating costs and deliver customer orders on time. The lack of an efficient method in balancing assembly line can create threatening problems for manufacturing organizations. The use of assembly line balancing methods cannot balan...

متن کامل

Development of Model and Algorithm for Depot Balancing Multi-Depot Vehicle Scheduling Problem Considering Depot Balancing

The main of multi-depot vehicle scheduling problem (MDVSP) is to schedule the timetabled trips using limited resources, optimally. The problem is very important in the management of the transportation systems. One of the most useful ways to better manage these systems is to consider the real conditions including depot balancing constraints. To normalize the number of vehicles departed from each...

متن کامل

A Hybrid Unconscious Search Algorithm for Mixed-model Assembly Line Balancing Problem with SDST, Parallel Workstation and Learning Effect

Due to the variety of products, simultaneous production of different models has an important role in production systems. Moreover, considering the realistic constraints in designing production lines attracted a lot of attentions in recent researches. Since the assembly line balancing problem is NP-hard, efficient methods are needed to solve this kind of problems. In this study, a new hybrid met...

متن کامل

Pareto Optimal Balancing of Four-bar Mechanisms Using Multi-Objective Differential Evolution Algorithm

Four-bar mechanisms are widely used in the industry especially in rotary engines. These mechanisms are usually applied for attaining a special motion duty like path generation; their high speeds in the industry cause an unbalancing problem. Hence, dynamic balancing is essential for their greater efficiency. In this research study, a multi-objective differential evolution algorithm is used for P...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013